// ========================================================================= //

// includes
#include "stdio.h"
#include "stdlib.h"
#include "time.h"
#include "string.h"
#include "limits.h"
#include "float.h"



#define JOTAI_NUM_RANDS_ 25

const unsigned rand_primes[JOTAI_NUM_RANDS_] = {179, 103, 479, 647, 229, 37, 271, 557, 263, 607, 18743, 50359, 21929, 48757, 98179, 12907, 52937, 64579, 49957, 52567, 507163, 149939, 412157, 680861, 757751};

int next_i() {
  int counter = 0;
  return rand_primes[(++counter)%JOTAI_NUM_RANDS_];
}

float next_f() {
  int counter = 0;
  return rand_primes[(++counter)%JOTAI_NUM_RANDS_] / 757751.0F;
} 


// Usage menu
void usage() {
    printf("%s", "Usage:\n\
    prog [ARGS]\n\
\nARGS:\n\
       0            big-arr\n\
       1            big-arr-10x\n\
       2            empty\n\
\n\
");

}


// ------------------------------------------------------------------------- //

#define NULL ((void*)0)
typedef unsigned long size_t;  // Customize by platform.
typedef long intptr_t; typedef unsigned long uintptr_t;
typedef long scalar_t__;  // Either arithmetic or pointer type.
/* By default, we understand bool (as a convenience). */
typedef int bool;
#define false 0
#define true 1

/* Forward declarations */
typedef  struct TYPE_3__   TYPE_1__ ;

/* Type definitions */
struct TYPE_3__ {int predecessor_offset; int idom; int loop_header; int level; int children; int next_child; scalar_t__ predecessors_count; scalar_t__ successors_count; int /*<<< orphan*/  successors_storage; int /*<<< orphan*/  successors; scalar_t__ flags; } ;
typedef  TYPE_1__ zend_basic_block ;

/* Variables and functions */

__attribute__((used)) static void initialize_block(zend_basic_block *block) {
	block->flags = 0;
	block->successors = block->successors_storage;
	block->successors_count = 0;
	block->predecessors_count = 0;
	block->predecessor_offset = -1;
	block->idom = -1;
	block->loop_header = -1;
	block->level = -1;
	block->children = -1;
	block->next_child = -1;
}

// ------------------------------------------------------------------------- //

int main(int argc, char *argv[]) {

    if (argc != 2) {
        usage();
        return 1;
    }

    int opt = atoi(argv[1]);
    switch(opt) {

    // big-arr
    case 0:
    {
          int _len_block0 = 65025;
          struct TYPE_3__ * block = (struct TYPE_3__ *) malloc(_len_block0*sizeof(struct TYPE_3__));
          for(int _i0 = 0; _i0 < _len_block0; _i0++) {
              block[_i0].predecessor_offset = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].idom = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].loop_header = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].level = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].children = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].next_child = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].predecessors_count = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].successors_count = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].successors_storage = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].successors = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].flags = ((-2 * (next_i()%2)) + 1) * next_i();
        
          }
        
          initialize_block(block);
          free(block);
        
        break;
    }
    // big-arr-10x
    case 1:
    {
          int _len_block0 = 100;
          struct TYPE_3__ * block = (struct TYPE_3__ *) malloc(_len_block0*sizeof(struct TYPE_3__));
          for(int _i0 = 0; _i0 < _len_block0; _i0++) {
              block[_i0].predecessor_offset = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].idom = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].loop_header = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].level = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].children = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].next_child = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].predecessors_count = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].successors_count = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].successors_storage = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].successors = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].flags = ((-2 * (next_i()%2)) + 1) * next_i();
        
          }
        
          initialize_block(block);
          free(block);
        
        break;
    }
    // empty
    case 2:
    {
          int _len_block0 = 1;
          struct TYPE_3__ * block = (struct TYPE_3__ *) malloc(_len_block0*sizeof(struct TYPE_3__));
          for(int _i0 = 0; _i0 < _len_block0; _i0++) {
              block[_i0].predecessor_offset = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].idom = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].loop_header = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].level = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].children = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].next_child = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].predecessors_count = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].successors_count = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].successors_storage = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].successors = ((-2 * (next_i()%2)) + 1) * next_i();
          block[_i0].flags = ((-2 * (next_i()%2)) + 1) * next_i();
        
          }
        
          initialize_block(block);
          free(block);
        
        break;
    }
    default:
        usage();
        break;

    }

    return 0;
}
